Description: 本程序是利用Ford和Fulkerson迭加算法，求最小费用最大流-use of this procedure is superposition Ford and Fulkerson algorithm, the minimum cost for maximum flow Platform: |
Size: 2703 |
Author:李平 |
Hits:
Description: 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory Platform: |
Size: 2925 |
Author:申辉 |
Hits:
Description: 题目:求网络的最小费用最大流-C语言
已经经过调试,没有问题!-topics : finding the minimum cost maximum flow-through C language has been tested and no problems! Platform: |
Size: 21150 |
Author:周琳 |
Hits:
Description: 用Floyd算法设计的最小费用最大流，求最大流时，用的是标号算法-Floyd algorithm design with the minimum cost maximum flow, for maximum flow, the algorithm is labeling Platform: |
Size: 1030 |
Author:杨 |
Hits:
Description: 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory Platform: |
Size: 3072 |
Author:申辉 |
Hits:
Description: 最小费用最大流问题,是用C实现的，比较高效率-Minimum cost maximum flow problem is to use C to achieve relatively high efficiency Platform: |
Size: 14336 |
Author:雷毅华 |
Hits:
Description: This algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this.-This is algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this. Platform: |
Size: 2048 |
Author:dupek |
Hits:
Description: 用于求解网络的最小费用最大流问题，求一个网络中的最大流-Network for solving the minimum cost maximum flow problem, find the maximum flow in a network Platform: |
Size: 2048 |
Author:wuhao |
Hits:
Description: 最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。-Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements. Platform: |
Size: 1024 |
Author:刘适 |
Hits:
Description: 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow. Platform: |
Size: 1024 |
Author:刘适 |
Hits:
Description: 最小费用流问题用于求解，图论中两地区运输费用最少的问题，本程序通过MATLAB解决这一问题-For solving the minimum cost flow problem in graph theory two least-cost regional transportation issues, the procedure to solve this problem through MATLAB Platform: |
Size: 1024 |
Author:张行 |
Hits:
Description: 程序由C语言完成，用Visual Studio 2012编译即可运行。
首先图的格式应为邻接矩阵，程序会提示输入n的大小，然后依次输入节点i，j，以及该节点的容量和成本。容量运费为0可以不用填写。以此类推，直到输入的节点为-1，-1则停止输入。
程序输出最小成本流邻接矩阵和最小成本。-Procedures done by the C language, using Visual Studio 2012 compiler to run. First graph format should be the adjacency matrix, the program prompts for the size of n, followed by the input node i, j, and the capacity and cost of the node. Freight capacity is 0 can not fill. And so on, until the input node is-1,-1 stop input. The minimum cost flow program output adjacency matrix and minimum cost. Platform: |
Size: 1024 |
Author:若相见 |
Hits:
Description: 此程序能够解决网络中最小费用最大流问题，内含调试结果及解释。并附有分析流程，结果分析。-This program can solve the minimum cost maximum network flow problem, containing debugging results and interpretation. Together with the analysis process, the results of the analysis. Platform: |
Size: 4057088 |
Author:dragon gao |
Hits:
Description: 网络流算法和最小费用流，用来处理图论问题中的流量计算和流量限制的费用流计算-Network flow algorithm and the minimum cost flow problem in graph theory to deal with the cost of computing and traffic flow restrictions stream computing Platform: |
Size: 2048 |
Author:yin |
Hits:
Description: 使用MFC实现最小费用流算法 包括在界面上画拓扑图等功能，编译器VC6.0(Using MFC to realize the minimum cost flow algorithm, including the function of drawing topological graph on the interface, compiler VC6.0) Platform: |
Size: 6120448 |
Author:soon123 |
Hits:
Search - Minimum Cost Flow